Quantum Supremacy Circuit Simulation on Sunway TaihuLight
نویسندگان
چکیده
منابع مشابه
Comments on the parallelization efficiency of the Sunway TaihuLight supercomputer
In the world of supercomputers, the large number of processors requires to minimize the inefficiencies of parallelization, which appear as a sequential part of the program from the point of view of Amdahl’s law. The recently suggested new figure of merit is applied to the recently presented supercomputer, and the timeline of ”Top 500” supercomputers is scrutinized using the metric. It is demons...
متن کاملAncilla-driven instantaneous quantum polynomial time circuit for quantum supremacy
Instantaneous quantum polynomial time (IQP) is a model of (probably) non-universal quantum computation. Since it has been proven that IQP circuits are unlikely to be simulated classically up to a multiplicative error and an error in the l1 norm, IQP is considered as one of the promising classes that demonstrates quantum supremacy. Although IQP circuits can be realized more easily than a univers...
متن کاملQuantum Supremacy and the Complexity of Random Circuit Sampling
A critical milestone on the path to useful quantum computers is quantum supremacy – a demonstration of a quantum computation that is prohibitively hard for classical computers. A leading near-term candidate, put forth by the Google/UCSB team, is sampling from the probability distributions of randomly chosen quantum circuits, which we call Random Circuit Sampling (RCS). In this paper we study bo...
متن کاملComplexity-Theoretic Foundations of Quantum Supremacy Experiments
In the near future, there will likely be special-purpose quantum computers with 40-50 high-quality qubits. This paper lays general theoretical foundations for how to use such devices to demonstrate “quantum supremacy”: that is, a clear quantum speedup for some task, motivated by the goal of overturning the Extended Church-Turing Thesis as confidently as possible. First, we study the hardness of...
متن کاملOptimized Aaronson-Gottesman stabilizer circuit simulation through quantum circuit transformations
In this paper we improve the layered implementation of arbitrary stabilizer circuits introduced by Aaronson and Gottesman in Phys. Rev. A 70(052328), 2004. In particular, we reduce their 11-stage computation -H-C-P-C-P-C-H-P-C-P-Cinto an 8-stage computation of the form -H-CCZ-P-H-P-CZ-C-. We show arguments in support of using -CZstages over the -Cstages: not only the use of -CZstages allows a s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2020
ISSN: 1045-9219,1558-2183,2161-9883
DOI: 10.1109/tpds.2019.2947511